Experimental Computation and Visual Theorems

نویسنده

  • Jonathan M. Borwein
چکیده

Long before current graphic, visualisation and geometric tools were available, John E. Littlewood (1885-1977) wrote in his delightful Miscellany: A heavy warning used to be given [by lecturers] that pictures are not rigorous; this has never had its bluff called and has permanently frightened its victims into playing for safety. Some pictures, of course, are not rigorous, but I should say most are (and I use them whenever possible myself). [p. 53] Over the past five years, the role of visual computing in my own research has expanded dramatically. In part this was made possible by the increasing speed and storage capabilities—and the growing ease of programming—of modern multi-core computing environments. But, at least as much, it has been driven by my group’s paying more active attention to the possibilities for graphing, animating or simulating most mathematical research activities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 9 D ec 1 99 8 EQUIVARIANT DE RHAM THEORY AND GRAPHS

Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental theorems in equivariant de Rham theory may, on closer inspection, turn out simply to be theorems about graphs. In this paper we show that for some familiar theorems...

متن کامل

v 1 [ m at h . D G ] 3 1 A ug 1 99 8 EQUIVARIANT DE RHAM THEORY AND GRAPHS

Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental theorems in equivariant de Rham theory may, on closer inspection, turn out simply to be theorems about graphs. In this paper we show that for some familiar theorems...

متن کامل

A note on symmetric duality in vector optimization problems

In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".

متن کامل

تحلیل کرانه فوقانی اکستروژن مستقیم چرخ دنده های ساده باپروفیل دندانه اصلاح شده

This paper describes an upper bound analysis of cold forward extrusion of spur gears with modified tooth profile. Spur gear geometrical parameters such as module, number of teeth, pressure angle, bore radius and addendum modification factor were input to a computer program written in Visual Basic. Then spur gear, billet and extrusion die cavity were modeled automatically in SolidWorks. For uppe...

متن کامل

Elementary Abelian Covers of Graphs

Let CG (X ) be the set of all (equivalence classes of) regular covering projections of a given connected graph X along which a given group G ≤ Aut X of automorphisms lifts. There is a natural lattice structure on CG (X ), where ℘1 ≤ ℘2 whenever ℘2 factors through ℘1. The sublattice CG (℘) of coverings which are below a given covering ℘ : X̃ → X naturally corresponds to a lattice NG (℘) of certai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014